Feasible Programs from Proofs
نویسنده
چکیده
We restrict induction and recursion on notation in all nite types so as to characterize the polynomial time computable functions. The restrictions are obtained by enriching the type structure with the formation of types (and formulas A (B as well as 8 x A with \complete" variables x, and by adding linear concepts to the lambda calculus (for object terms and proof terms). For the arithmetical system we deene modiied realizability and show that the programs extracted from proofs of 0 2-theorems characterize the polynomial time computable functions.
منابع مشابه
Extracting Feasible Programs
This work in progress paper presents a methodology for reasoning about the computational complexity of functional programs, which are extracted from proofs. We suggest a first order arithmetic AT which is a syntactic restriction of Peano arithmetic. We establish that the set of functions which is provably total in AT, is exactly the set of polynomial time functions. This result has been accepte...
متن کاملAutomatic Proof Generation in Kleene Algebra with Tests
Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean subalgebra. The addition of tests allows one to encode while programs as KAT terms, thus the equational theory of KAT can express (propositional) program equivalenc...
متن کاملFormal verification of cryptographic security proofs
Verifying cryptographic security proofs manually is inherently tedious and error-prone. The game-playing technique for cryptographic proofs advocates a modular proof design where cryptographic programs called games are transformed stepwise such that each step can be analyzed individually. This code-based approach has rendered the formal verification of such proofs using mechanized tools feasibl...
متن کاملAll Linear and Integer Programs Are Slim 3-Way Transportation Programs
We show that any rational convex polytope is polynomial-time representable as a three-way linesum transportation polytope of “slim” (r, c, 3) format. This universality theorem has important consequences for linear and integer programming and for confidential statistical data disclosure. We provide a polynomial-time embedding of arbitrary linear programs and integer programs in such slim transpo...
متن کاملInformation from Deduction: Models and Proofs
This report documents the program and the outcomes of Dagstuhl Seminar 15381 “Information from Deduction: Models and Proofs”. The aim of the seminar was to bring together researchers working in deduction and applications that rely on models and proofs produced by deduction tools. Proofs and models serve two main purposes: (1) as an upcoming paradigm towards the next generation of automated dedu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000